#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
vector<LL>g[maxn];
LL id[maxn],a[maxn],n;
bool vis[maxn];
bool cmp(LL A,LL B){
    return id[A]<id[B];
}
void bfs(){
    queue<LL>que;
    LL s=1;que.push(s);vis[s]=true;
    LL tot=0;
    while(!que.empty()){
        LL u=que.front();que.pop();
        if(u!=a[++tot]){
            cout<<"NO"<<"\n";return;
        }
        for(LL i=0;i<g[u].size();i++){
            LL v=g[u][i];
            if(vis[v]) continue;
            vis[v]=true;
            que.push(v);
        }
    }
    cout<<"YES"<<"\n";
    return;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  cin>>n;
  for(LL i=1;i<n;i++){
    LL u,v;cin>>u>>v;
    g[u].push_back(v);g[v].push_back(u);
  }
  for(LL i=1;i<=n;i++) cin>>a[i];
  for(LL i=1;i<=n;i++){
    id[a[i]]=i;
  }
  for(LL i=1;i<=n;i++){
    sort(g[i].begin(),g[i].end(),cmp);
  }
  bfs();
return 0;
}
